P Systems with Elementary Active Membranes: Beyond NP and coNP
نویسندگان
چکیده
We prove that a uniform family of P systems with active membranes, where division rules only operate on elementary membranes and dissolution rules are avoided, can be used to solve the following PP-complete decision problem in polynomial time: given a Boolean formula of m variables in 3CNF, do at least √ 2m among the 2 possible truth assignments satisfy it? As a consequence, the inclusion PP ⊆ PMCAM(−d,−n) holds: this provides an improved lower bound on the class of languages decidable by this kind of P systems.
منابع مشابه
Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
We investigate the computing power and the efficiency of P systems with active membranes without polarizations, working in the minimally parallel mode. We prove that such systems are computationally complete and able to solve NP-complete problems even when the rules are of a restricted form, e.g., for establishing computational completeness we only need rules handling single objects and no divi...
متن کاملOn the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution
Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful features, such as electrical charges (polarizations) associated to membranes, evolution rules, communication rules, and strong or weak forms of division rules. In this paper we c...
متن کاملActive Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
In this paper we introduce a variant of membrane systems with elementary division and without charges. We allow only elementary division where the resulting membranes are identical; we refer to this using the biological term symmetric division. We prove that this model characterises P. This result characterises the power of a class of membrane systems that fall under the so called P conjecture ...
متن کاملPolarizationless P Systems with Active Membranes: Computational Complexity Aspects
P systems with active membranes, in their classical definition, make use of noncooperative rules only. However, it is well known that in living cells, proteins interact among them yielding new products. Inspired by this biological phenomenon, the previous framework is reformulated in this paper, allowing cooperation in object evolution rules, while removing electrical charges associated with me...
متن کاملAntimatter as a Frontier of Tractability in Membrane Computing
It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the complexity class P (see [6], Th. 2). In this paper, we prove that if such P system model is endowed with antimatter and annihilation rules, then NP problems can be solved. In this wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010